Amílcar Sernadas, Extending Classical Logic for Reasoning about Quantum Systems
نویسندگان
چکیده
The exogenous quantum propositional logic (EQPL) was proposed in [13, 14, 15] for modeling and reasoning about quantum systems, embodying all that is stated in the relevant postulates of quantum physics (as presented, for instance, in [9, 16]). The logic was designed from the semantics upwards, starting with the key idea of adopting superpositions of classical models as the models of the proposed quantum logic. The EQPL approach to quantum reasoning is quite different from the mainstream approach [8, 10]. The latter, as initially proposed by Birkhoff and von Neumann [6], focuses on the lattice of closed subspaces of a Hilbert space and replaces the classical connectives by new connectives representing the lattice-theoretic operations, while the semantics of the former uses superpositions of classical models, leading to a natural extension of the classical language containing the classical connectives (just as modal languages are extensions of the classical language). Furthermore, EQPL allows quantitative reasoning about amplitudes and probabilities, being in this respect much closer to the possible-worlds logic for probability reasoning than to the mainstream quantum logics. Finally, EQPL is designed to reason about finite collections of qubits and, therefore, it is suitable for applications in quantum computation and information. In fact, each EQPL model is a superposition of classical valuations that corresponds to a unit vector expressed in the computational basis of the Hilbert space resulting from the tensor product of the independent qubit systems. It is possible to express in EQPL a wide range of properties of states of such a finite collection of qubits. For example, one can impose that some qubits are independent of (that is, not entangled with) other qubits; one can prescribe the amplitudes of a specific quantum state; one can assert the probability of a classical outcome after a projective measurement over the computational basis; and, one can also impose classical constraints on the admissible quantum states. The talk is focused on a decidable fragment of EQPL obtained by relaxing the semantic structures of EQPL [7]: inner product spaces over an arbitrary real closed field and its algebraic closure are used instead of Hilbert spaces. The decidability results from the fact that the first order theory of such fields is decidable [5, 17], using a technique inspired by related work on probabilistic logic [1]. More recent developments are mentioned at the end of the talk, namely the exoge-nous quantum temporal propositional logic [12] and …
منابع مشابه
Reasoning About Imperative Quantum Programs
A logic for reasoning about states of basic quantum imperative programs is presented. The models of the logic are ensembles obtained by attaching probabilities to pairs of quantum states and classical states. The state logic is used to provide a sound Hoare-style calculus for quantum imperative programs. The calculus is illustrated by proving the correctness of the Deutsch algorithm.
متن کاملApproximate reasoning about logic circuits with single-fan-out unreliable gates
A complete extension of classical propositional logic is proposed for reasoning about circuits with unreliable gates. The pitfalls of extrapolating classical reasoning to such unreliable circuits are extensively illustrated. Several metatheorems are shown to hold with additional provisos. Applications are provided in verification of logic circuits and improving their reliability.
متن کاملReasoning About Quantum Systems
A new logic is proposed for reasoning about quantum systems. The logic embodies the postulates of quantum physics and it was designed from the semantics upwards by identifying quantum models with superpositions of classical models. This novel approach to quantum logic is completely different from the traditional approach of Birkhoff and von Neumann. It has the advantage of making quantum logic ...
متن کاملCraig Interpolation in the Presence of Unreliable Connectives
Arrow and turnstile interpolations are investigated in UCL (introduced in [32]), a logic that is a complete extension of classical propositional logic for reasoning about connectives that only behave as expected with a given probability. Arrow interpolation is shown to hold in general and turnstile interpolation is established under some provisos. Mathematics Subject Classification (2010). 03B4...
متن کاملQuantum Institutions
The exogenous approach to enriching any given base logic for probabilistic and quantum reasoning is brought into the realm of institutions. The theory of institutions helps in capturing the precise relationships between the logics that are obtained, and, furthermore, helps in analyzing some of the key design decisions and opens the way to make the approach more useful and, at the same time, mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013